Preprocessing chains for fast dihedral rotations is hard or even impossible
نویسندگان
چکیده
منابع مشابه
Preprocessing chains for fast dihedral rotations is hard or even impossible
We examine a computational geometric problem concerning the structure of polymers. We model a polymer as a polygonal chain in three dimensions. Each edge splits the polymer into two subchains, and a dihedral rotation rotates one of these subchains rigidly about the edge. The problem is to determine, given a chain, an edge, and an angle of rotation, if the motion can be performed without causing...
متن کاملIs psychology hard or impossible? Reflections on the conditional
We discuss the various explanations that have been offered to account for subjects’ behaviour in Wason’s famous selection task, and find them wanting. We argue that what is lacking is a good understanding of a subject’s semantics for the key expressions involved, and an understanding of how this semantics is affected by the demands the task puts upon the subject’s cognitive system.
متن کاملFast Balanced Partitioning Is Hard Even on Grids and Trees
Two kinds of approximation algorithms exist for the k-BALANCED PARTITIONING problem: those that are fast but compute unsatisfactory approximation ratios, and those that guarantee high quality ratios but are slow. In this article we prove that this tradeoff between running time and solution quality is unavoidable. For the problem a minimum number of edges in a graph need to be found that, when c...
متن کاملWhen is Rotations Averaging Hard?
Rotations averaging has become a key subproblem in global Structure from Motion methods. Several solvers exist, but they do not have guarantees of correctness. They can produce high-quality results, but also sometimes fail. Our understanding of what makes rotations averaging problems easy or hard is still very limited. To investigate the difficulty of rotations averaging, we perform a local con...
متن کاملReconfiguring planar dihedral chains
We consider the dihedral model of motion for chains with fixed edge lengths, in which the angle between every pair of successive edges remains fixed. A chain is flat-state connected if every planar configuration can be transformed to any other via a series of dihedral motions which maintain simplicity. Here we prove that three classes of chains are flat-state connected. The first class is that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2003
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(02)00156-6